A note on constrained OWA aggregation

Yager considered the problem of maximizing an OWA aggregation of a group of variables that are interrelated and constrained by a collection of linear inequalities and he showed how this problem can be modelled as a mixed integer linear programming problem. In this short communication we show a simple algorithm for exact computation of optimal solutions to a constrained OWA aggregation problem with a single constraint on the sum of all decision variables. 1 Constrained OWA aggregations An Ordered Weighted Averaging (OWA) is a mapping F : Rn → R that has an associated weighting vector w = (w1, . . . , wn) of having the properties w1 + · · ·+ wn = 1, 0 ≤ wi ≤ 1, i = 1, . . . , n, and such that F (x1, . . . , xn) = n ∑